The abstract Cauchy problem for the non-stationary bulk queue M(t)|M[k, B]|1

نویسنده

  • Yong Chol Chon
چکیده

The abstract Cauchy problem for the non-stationary bulk queue M(t)|M[k, B]|1 Abstract We derived state probability equations describing the queue M (t)| M [k, B]|1 and formulated as an abstract Cauchy problem to investigate by means of the semi-group theory of bounded linear operators in functional analysis. With regard to the abstract Cauchy problem of this queue, we determined the eigenfunctions of the maximal operator and showed some properties of the Dirichlet operator.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nvestigation of a Boundary Layer Problem for Perturbed Cauchy-Riemann Equation with Non-local Boundary Condition

Boundary layer problems (Singular perturbation problems) more have been applied for ordinary differential equations. While this theory for partial differential equations have many applications in several fields of physics and engineering. Because of complexity of limit and boundary behavior of the solutions of partial differential equations these problems considered less than ordinary case. In ...

متن کامل

M/M/1 Bulk Arrival and Bulk Service Queue with Randomly Varying Environment

This paper studies two stochastic bulk arrival and bulk service queueing Models (A) and (B) with k varying environments. The system has infinite storing capacity and the arrival and service sizes are finite valued random variables. Matrix partitioning method is used to study the models. In Model (A) the maximum of the arrival sizes in all environments is greater than the maximum of the service ...

متن کامل

Developing a New Bi-Objective Functions Model for a Hierarchical Location-Allocation Problem Using the Queuing Theory and Mathematical Programming

In this research, a hierarchical location-allocation problem is modeled in a queue framework. The queue model is considered as M/M/1/k, in which system capacity is finite, equals to k. This is the main contribution of the current research. Customer's enters to the system in order to find the service according to a Poisson. In this problem, the hierarchical location-allocation model is considere...

متن کامل

M M m K Queue With Additional Servers and Discouragement (RESEARCH NOTE)

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1311.0960  شماره 

صفحات  -

تاریخ انتشار 2013